All the AES You Need on Cortex-M3 and M4
نویسندگان
چکیده
This paper describes highly-optimized AES-{128, 192, 256}CTR assembly implementations for the popular ARM Cortex-M3 and M4 embedded microprocessors. These implementations are about twice as fast as existing implementations. Additionally, we provide the fastest bitsliced constant-time and masked implementations of AES-128-CTR to protect against timing attacks, power analysis and other (first-order) sidechannel attacks. All implementations, including an architecture-specific instruction scheduler and register allocator, which we use to minimize expensive loads, are released into the public domain.
منابع مشابه
Localization of a family of muscarinic receptor mRNAs in rat brain.
A family of 4 rat muscarinic receptors (m1, m2, m3, and m4) have recently been cloned and sequenced (Bonner et al., 1987). Since pharmacological probes that are presently available do not appear to distinguish among 3 of these muscarinic receptors, we constructed oligonucleotide probes corresponding to the N-terminal sequences of the muscarinic receptors and used them to specifically localize m...
متن کاملChaskey: a Lightweight MAC Algorithm for Microcontrollers
We propose Chaskey: a very efficient Message Authentication Code (MAC) algorithm for 32-bit microcontrollers. It is intended for applications that require 128-bit security, yet cannot implement standard MAC algorithms because of stringent requirements on speed, energy consump tion, or code size. Chaskey is a permutation-based MAC algorithm that uses the Addition-RotationXOR (ARX) design method...
متن کاملChaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers
We propose Chaskey: a very efficient Message Authentication Code (MAC) algorithm for 32-bit microcontrollers. It is intended for applications that require 128-bit security, yet cannot implement standard MAC algorithms because of stringent requirements on speed, energy consumption, or code size. Chaskey is a permutation-based MAC algorithm that uses the Addition-RotationXOR (ARX) design methodol...
متن کامل2-halvable Complete 4-partite Graphs
A complete 4-partite graph Km1,m2,m3,m4 is called d-halvable if it can be decomposed into two isomorphic factors of diameter d. In the class of graphs Km1,m2,m3,m4 with at most one odd part all d-halvable graphs are known. In the class of biregular graphs Km1,m2,m3,m4 with four odd parts (i.e., the graphs Km,m,m,n and Km,m,n,n) all d-halvable graphs are known as well, except for the graphs Km,m...
متن کاملAcute myeloid leukemia-FAB classification and its correlation with clinico-haematological features.
The French-American and British (FAB) classification of 62 consecutive cases of acute myeloid leukemia was undertaken. AML-M2 was the commonest FAB type (32.26%), followed by M1 and M4 (22.58% each), M5 (8.6%) and M6 and M7 (1.61% each), respectively. One of the patients was diagnosed as AML-MO (not a FAB type). The mean age of M1, M2, M3 and M5 cases was between 25 and 29 years, whereas in M4 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2016 شماره
صفحات -
تاریخ انتشار 2016